Transmission Capacity Assignment to Two Service Classes with Different Priorities
نویسندگان
چکیده
We consider a two-priority queueing system which represents an ATM node serving both variable bit rate (VBR) and unspeciied bit rate (UBR) traac. We determine the (transmission or link) capacity necessary for each traac type to guarantee prespeciied quality of service (QoS) requirements. This is done by means of a steady state performance analysis of the tail distribution of the buuer occupancies of the associated two-priority queueing system.
منابع مشابه
Service Level Based Capacity Rationing Procedure for Make-To-Order Manufacturing Systems
We extend a heuristic method within the framework of “dynamic capacity apportionment procedure” (DCAP) to allocate an existing capacity among the classes with different profit contributions. In general, DCAP is applied when some capacity shortage exists and can not be enhanced in short - run. Our proposed approach is constructed for a make - to - order manufacturing system that produces a varie...
متن کاملTwo-stage stochastic programming model for capacitated complete star p-hub network with different fare classes of customers
In this paper, a stochastic programming approach is applied to the airline network revenue management problem. The airline network with the arc capacitated single hub location problem based on complete–star p-hub network is considered. We try to maximize the profit of the transportation company by choosing the best hub locations and network topology, applying revenue management techniques to al...
متن کاملContinuous Learning Automata Solutions to the Capacity Assignment Problem
The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most approaches consider a single class of packets flowing through the network, but in reality, different classes of packets with different packet lengths and priorities are transmitted over the netw...
متن کاملA Fast Efficient Solution to the Capacity Assignment Problem Using Discretized Learning Automata
The Capacity Assignment (CA) problem focuses on finding the best possible set of capacities for the links that satisfies the traffic requirements in a prioritized network while minimizing the cost. Most approaches consider a single class of packets flowing through the network, but in reality, different classes of packets with different packet lengths and priorities are transmitted over the netw...
متن کاملCDMA satellite capacity dynamics with imperfect power control for simultaneous QoS classes
In this paper, we focus on a non-GEO scenario and investigate the effect of actual power control performance on the return capacity dynamics of a DS-CDMA system. We consider mobile users at different speeds and transmission rates yielding several classes of services. We compute analytically the ideal maximum return capacity of the system which is shown not to be fixed but limited by an hyperpla...
متن کامل